An iterative pseudo-gap enumeration approach for the Multidimensional Multiple-choice Knapsack Problem

Heuristic algorithms for the multiple-choice multidimensional knapsack problem

A "reduce and solve" approach for the multiple-choice multidimensional knapsack problem

The multiple-choice multidimensional knapsack problem (MMKP) is a well-known NP-hard combinatorial optimization problem with a number of important applications. In this paper, we present a ”reduce and solve” heuristic approach which combines problem reduction techniques with an Integer Linear Programming (ILP) solver (CPLEX). The key ingredient of the proposed approach is a set of group fixing ...

The Multiple-choice Knapsack Problem

This paper treats the multiple-choice (continuous) knapsack problem P: n mi n mi maximize L .L cijxijsubjectto(l) I I aij x ij";b,(2)0,,;xij";1,i=I,2, i=l J=l i=l J=1 ... , n, j = 1,2, .... mi and (3) at most one of x il, x i2' ... , x im. is positive for i = 1,2, ., ., n, , where n, mi are positive integers and aij' Cij' bare nonnegative real numbers. Two approximate algorithms and an exact br...

An Efficient Algorithm for Reducing the Duality Gap in a Special Class of the Knapsack Problem

A special class of the knapsack problem is called the separable nonlinear knapsack problem. This problem has received considerable attention recently because of its numerous applications. Dynamic programming is one of the basic approaches for solving this problem. Unfortunately, the size of state-pace will dramatically increase and cause the dimensionality problem. In this paper, an efficient a...

An Efficient Algorithm for Reducing the Duality Gap in a Special Class of the Knapsack Problem

A special class of the knapsack problem is called the separable nonlinear knapsack problem. This problem has received considerable attention recently because of its numerous applications. Dynamic programming is one of the basic approaches for solving this problem. Unfortunately, the size of state-pace will dramatically increase and cause the dimensionality problem. In this paper, an efficient a...